MA 538
Graph Theory
Selected topics may include graph colouring, extremal graph theory, planar graphs, random graphs, network flows, algebraic methods in graph theory, Ramsay theory for graphs, matching theory, graph algorithms; application of graph theory, such as applications to scheduling, VLSI circuits, compiler design, computer vision and the design of internet search engines.
Exclusions: MA338 or equivalent.
Selected topics may include graph colouring, extremal graph theory, planar graphs, random graphs, network flows, algebraic methods in graph theory, Ramsay theory for graphs, matching theory, graph algorithms; application of graph theory, such as applications to scheduling, VLSI circuits, compiler design, computer vision and the design of internet search engines.
Exclusions: MA338 or equivalent.
Selected topics may include graph colouring, extremal graph theory, planar graphs, random graphs, network flows, algebraic methods in graph theory, Ramsay theory for graphs, matching theory, graph algorithms; application of graph theory, such as applications to scheduling, VLSI circuits, compiler design, computer vision and the design of internet search engines.
Exclusions: MA338 or equivalent.
